An iterative matheuristic for the inventory routing problem
نویسندگان
چکیده
منابع مشابه
A matheuristic for the truck and trailer routing problem
3 COPA, Department of Industrial Engineering, Universidad de los Andes, Bogota, Colombia {amedagli, nvelasco}@uniandes.edu.co In the truck and trailer problem (TTRP), raised for instance by milk collection in rural areas, a heterogeneous fleet composed of mt trucks and mr trailers (mr < mt) serves a set of customers N = {1, 2, ..., n} from a main depot, denoted as node 0. Each customer i ∈N h...
متن کاملA matheuristic for the Team Orienteering Arc Routing Problem
In the Team Orienteering Arc Routing Problem (TOARP) the potential customers are located on the arcs of a graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for...
متن کاملA matheuristic approach for the Pollution-Routing Problem
This paper deals with the Pollution-Routing Problem (PRP), a Vehicle Routing Problem (VRP) with environmental considerations, recently introduced in the literature by [Bektaş and Laporte (2011), Transport. Res. B-Meth. 45 (8), 1232-1250]. The objective is to minimize operational and environmental costs while respecting capacity constraints and service time windows. Costs are based on driver wag...
متن کاملA parallel matheuristic for the technician routing and scheduling problem
The Technician Routing and Scheduling Problem (TRSP) consists in routing staff to serve requests for service, taking into account time windows, skills, tools, and spare parts. Typical applications include maintenance operations and staff routing in telecoms, public utilities, and in the health care industry. In this paper, we present a formal definition of the TRSP, discuss its relation with th...
متن کاملA matheuristic algorithm for the mixed capacitated general routing problem
We study the general routing problem de ned on a mixed graph and subject to capacity constraints. Such a problem aims to nd the set of routes of minimum overall cost servicing a subset of required elements like vertices, arcs and edges, without exceeding the capacity of a eet of homogeneous vehicles based at the same depot. The problem is a generalization of a large variety of node and arc rout...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2021
ISSN: 0305-0548
DOI: 10.1016/j.cor.2021.105262